Parallel Admissible Graph Rewriting
نویسندگان
چکیده
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in general whereas it is confluent in the case of weakly orthogonal term rewriting systems. We show, however, that the considered relation is always confluent, as well as confluent modulo bisimilarity, for a large class of graphs called admissible graphs. Afterwards, we define a parallel graph rewriting relation and propose an efficient parallel graph rewriting strategy.
منابع مشابه
On weakly orthogonal constructor-based graph rewriting
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not connuent in general whereas it is connuent in the case of weakly orthogonal term rewriting systems. We show, however , that the considered relation is always connuent, as well as connuent modulo bisimilarity, for a large class of grap...
متن کاملComplete Strategies for Admissible-Graph Collapsing Narrowing
Narrowing constitutes the basis of the operational semantics of modern declarative languages which integrate functional and logic programming paradigms. Efficient implementations of these languages consider first-order terms as graphs. In this paper, we investigate narrowing in the setting of graph rewriting systems. We take the full advantage of graph structures by allowing maximal sharing of ...
متن کاملAdmissible Graph Rewriting and Narrowing
We address the problem of graph rewriting and narrowing as the underlying operational semantics of rule-based programming languages. We propose new optimal graph rewriting and narrowing strategies in the setting of orthogonal constructor-based graph rewriting systems. For this purpose, we first characterize a subset of graphs, called admissible graphs. A graph is admissible if none of its defin...
متن کاملRational Unification in 28 Characters
We present a case study where Synchronising Graphs, a system of parallel graph transformation, are used to solve the syntactic unification problem for first order rational terms (with possibly infinite unifier). The solution we offer is efficient, that is quasi-linear, and simple: a program of 28 characters.
متن کاملParallel rewriting of graphs through the pullback approach
We continue here the development of our description of the pullback approach to graph rewriting-already shown to encompass both the NCE and the double-pushout approach, by describing parallel application of rewriting rules. We show that this new framework provides a genuine deenition of parallel rewriting (parallel application of several rewriting rules at several diierent places in the graph i...
متن کامل